Statistical mechanics of semi-supervised clustering in sparse graphs
نویسندگان
چکیده
منابع مشابه
Statistical Mechanics of Semi-Supervised Clustering in Sparse Graphs (Abstract)
We develop a statistical mechanics based approach for studying semi–supervised clustering in graphs in the presence of must and cannot links. We focus on bi– cluster graphs, and study the impact of the semi–supervision by varying the constraint density and overlap between the clusters. Recent results for unsupervised clustering in sparse graphs indicate that there is a critical ratio of within–...
متن کاملStatistical Mechanics of Semi-Supervised Clustering in Sparse Graphs
We theoretically study semi–supervised clustering in sparse graphs in the presence of pair–wise constraints on the cluster assignments of nodes. We focus on bi–cluster graphs, and study the impact of semi–supervision for varying constraint density and overlap between the clusters. Recent results for unsupervised clustering in sparse graphs indicate that there is a critical ratio of within–clust...
متن کاملImproving generative statistical parsing with semi-supervised word clustering
We present a semi-supervised method to improve statistical parsing performance. We focus on the well-known problem of lexical data sparseness and present experiments of word clustering prior to parsing. We use a combination of lexiconaided morphological clustering that preserves tagging ambiguity, and unsupervised word clustering, trained on a large unannotated corpus. We apply these clustering...
متن کاملSpectral clustering and semi-supervised learning using evolving similarity graphs
Spectral graph clustering has become very popular in recent years, due to the simplicity of its implementation as well as the performance of the method, in comparison with other popular ones. In this article, we propose a novel spectral graph clustering method that makes use of genetic algorithms, in order to optimise the structure of a graph and achieve better clustering results. We focus on e...
متن کاملSemi-supervised Clustering
Clustering is an unsupervised learning problem whose objective is to find a partition of the given data. However, a major challenge in clustering is to define an appropriate objective function in order to to find an optimal partition that is useful to the user. To facilitate data clustering, it has been suggested that the user provide some supplementary information about the data (eg. pairwise ...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: Journal of Statistical Mechanics: Theory and Experiment
سال: 2011
ISSN: 1742-5468
DOI: 10.1088/1742-5468/2011/08/p08009